Multi-statistic enumeration of two-stack sortable permutations
نویسنده
چکیده
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according to five statistics: length, number of descents, number of right-to-left and left-to-right maxima, and a fifth statistic that is closely linked to the factorization. Then, we show how one can translate this functional equation into a polynomial one. We thus prove that our five-variable generating function for two-stack-sortable permutations is algebraic of degree 20.
منابع مشابه
A Stack and a Pop Stack in Series
We study sorting machines consisting of a stack and a pop stack in series, with or without a queue between them. While there are, a priori, four such machines, only two are essentially different: a pop stack followed directly by a stack, and a pop stack followed by a queue and then by a stack. In the former case, we obtain complete answers for the basis and enumeration of the sortable permutati...
متن کاملSorted and or sortable permutations
In his Ph D thesis Julian West studied in depth a map that acts on permutations of the symmetric group Sn by partially sorting them through a stack The main motivation of this paper is to characterize and count the permutations of Sn which we call sorted permutations This is equivalent to counting preorders of increasing binary trees We rst nd a local characterization of sorted permutations The...
متن کاملA proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)
Zeilberger, D., A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/((n + 1)!(2n + l)!), Discrete Mathematics 102 (1992) 85-93. The Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hours of CPU time (of Maple running on Drexel University’s Sun network) established Julian West’s conjecture that 2-stack-s...
متن کامل132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
We describe the recursive structures of the set of two-stack sortable permutations which avoid 132 and the set of two-stack sortable permutations which contain 132 exactly once. Using these results and standard generating function techniques, we enumerate two-stack sortable permutations which avoid (or contain exactly once) 132 and which avoid (or contain exactly once) an arbitrary permutation ...
متن کامل2-stack Pushall Sortable Permutations
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series? Whether this problem is polynomial or NP-complete is still unanswered yet. In this article we introduce 2-stack pushall permutations which form a subclass of 2-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998